A note on coloured quadrangulations
نویسندگان
چکیده
منابع مشابه
A Note on Alternating Cycles in Edge-Coloured Graphs
Grossman and HH aggkvist gave a characterisation of two-edge-coloured graphs, which have an alternating cycle (i.e. a cycle in which no two consecutive edges have the same colour). We extend their characterisa-tion to edge-coloured graphs, with any number of colours. That is we show that if there is no alternating cycle in an edge-coloured graph, G, then it contains a vertex z, such that there ...
متن کاملA Note on Universal and Canonically Coloured Sequences
Combinatorics, Probability and Computing / Volume 18 / Special Issue 05 / September 2009, pp 683 689 DOI: 10.1017/S0963548309009961, Published online: 21 May 2009 Link to this article: http://journals.cambridge.org/abstract_S0963548309009961 How to cite this article: ANDRZEJ DUDEK, PETER FRANKL and VOJTĚCH RÖDL (2009). A Note on Universal and Canonically Coloured Sequences. Combinatorics, Proba...
متن کاملOn symmetric quadrangulations and triangulations
This article presents new enumerative results related to symmetric planar maps. In the first part a new way of enumerating rooted simple quadrangulations and rooted simple triangulations is presented, based on the description of two different quotient operations on symmetric simple quadrangulations and triangulations. In the second part, based on results of Bouttier, Di Francesco and Guitter an...
متن کاملOn symmetric quadrangulations
This note gathers observations on symmetric quadrangulations, with enumerative consequences. In the rst part a new way of enumerating rooted simple quadrangulations is presented, based on two di erent quotient operations of symmetric simple quadrangulations. In the second part, based on results of Bouttier, Di Francesco and Guitter and on quotient and substitution operations, the series of thre...
متن کاملComputing convex quadrangulations☆
We use projected Delaunay tetrahedra and a maximum independent set approach to compute large subsets of convex quadrangulations on a given set of points in the plane. The new method improves over the popular pairing method based on triangulating the point set.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1980
ISSN: 0012-365X
DOI: 10.1016/0012-365x(80)90011-4